Tournament Sequences and Meeussen Sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tournament Sequences and Meeussen Sequences

A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 ≤ 2ti. A Meeussen sequence is an increasing sequence of positive integers (m1, m2, . . .) such that m1 = 1, every nonnegative integer is the sum of a subset of the {mi}, and each integer mi − 1 is the sum of a unique such subset. We show that these two properties are isomorphic. That i...

متن کامل

0 Tournament Sequences and Meeussen Sequences

A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 ≤ 2ti. A Meeussen sequence is an increasing sequence of positive integers (m1,m2, . . .) such that m1 = 1, every nonnegative integer is the sum of a subset of the {mi}, and each integer mi − 1 is the sum of a unique such subset. We show that these two properties are isomorphic. That is...

متن کامل

Calculating the Frequency of Tournament Score Sequences

We indicate how to calculate the number of round-robin tournaments realizing a given score sequence. This is obtained by inductively calculating the number of tournaments realizing a score function. Tables up to 18 participants are obtained. 1. Tournaments and score sequences A (round-robin) tournament on a set P of n vertices (participants, teams, . . . ) is a directed graph obtained by orient...

متن کامل

Note on regular and coregular sequences

Let R be a commutative Noetherian ring and let M be a nitely generated R-module. If I is an ideal of R generated by M-regular sequence, then we study the vanishing of the rst Tor functors. Moreover, for Artinian modules and coregular sequences we examine the vanishing of the rst Ext functors.

متن کامل

Transitive partitions in realizations of tournament score sequences

A tournament is an oriented complete graph, and one containing no directed cycles is called transitive. A tournament T= (V,A) is called m-partition transitive if there is a partition V=X1∪· X2∪· · · ·∪· Xm such that the subtournaments induced by each Xi are all transitive, and T Contract grant sponsor: University of Dayton Research Council (to A. H. B.); Contract grant sponsor: National Science...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2000

ISSN: 1077-8926

DOI: 10.37236/1522